Comparing Position Auctions Computationally
نویسندگان
چکیده
Modern techniques for representing games and computing their Nash equilibria are approaching the point where they can be used to analyze market games. We demonstrate this by showing how the equilibria of different position auction mechanisms can be tractably identified using these techniques. These results enable detailed and quantitative comparisons of the different auction mechanisms—in terms of both efficiency and revenue— under different preference models and equilibrium selec-
منابع مشابه
Winner Determination Algorithms for Electronic Auctions: A Framework Design
During the past few years, auctions have become popular in conducting trade negotiations on the Internet. The design of new auctions and other negotiation protocols has become an important topic for both, industry and academia. Traditional auction mechanisms allow price-only negotiations for which the winner determination is a computationally simple task. However, the need for new auction mecha...
متن کاملX Simple Auctions with Simple Strategies
We introduce single-bid auctions as a new format for combinatorial auctions. In single-bid auctions, each bidder submits a single real-valued bid for the right to buy items at a fixed price. Contrary to other simple auction formats, such as simultaneous or sequential single-item auctions, bidders can implement no-regret learning strategies for single-bid auctions in polynomial time. Price of an...
متن کاملPricing in Position Auctions and Online Advertising∗
This paper analyzes position auctions with general pricing rules. In these auctions, there are several items to be allocated which are commonly ranked by agents with unit demand. The preeminent example of position auctions is the “generalized second-price” (GSP) auction used by major search engines to sell online advertising. Edelman et al. (2007) establish that the ex post equilibrium of the G...
متن کاملA Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملUsing Simultaneous Best Response to Find Symmetric Bayes-Nash Equilibria in Auctions
Finding Nash and Bayes-Nash equilibria in games is a hard problem both analytically and computationally. We restrict out attention to symmetric Bayes-Nash equilibria in auctions and propose a computational method that takes advantage of the symmetry of equilibria and structure of auction games. The method is iterated best-response where all players move simultaneously. We present experimental r...
متن کامل